GPU Acceleration for Particle Filter based LDPC Decoding

نویسندگان

  • Shuang Wang
  • Lijuan Cui
  • Samuel Cheng
  • Robert C. Huck
چکیده

A parallel belief propagation algorithm based on Particle Filtering (PF) for channel estimation and Low-Density Parity-Check (LDPC) decoding is presented in this paper based on Compute Unified Device Architecture (CUDA). The authors have found that compared with the traditional Belief Propagation (BP) algorithm with fixed estimated noise power, BP algorithm based on PF [1] not only gives a good real-time estimate for the channel noise, but it also achieves a lower decoding error rate. However, the implementation of PF algorithm increased the decoding complexity. As a new hardware and software architecture for addressing and managing computations, CUDA offers parallel data computing using the highly multithreaded coprocessor driven by very high memory bandwidth GPU. The parallel noise adaptive decoding algorithm, based on CUDA, allows variable nodes, factor nodes or particles to be updated simultaneously, thus provideing an efficient and fast way for implementing the decoder.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography

The speed at which two remote parties can exchange secret keys over a fixed-length fiber-optic cable in continuousvariable quantum key distribution (CV-QKD) is currently limited by the computational complexity of post-processing algorithms for key reconciliation. Multi-edge low-density paritycheck (LDPC) codes with low code rates and long block lengths were proposed for CV-QKD, in order to exte...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Particle Filtering Based LDPC Decoding Algorithm for Hierarchical Modulation Schemes

In this project, we present a neural network based particle filtering scheme to enhance the LDPC scheme. This is a decoding algorithm preferred for the hierarchical broadcasting systems. Unlike the traditional hierarchical demodulation approaches that suffer from serious interlayer interference (ILI), the proposed method exploits the iterative particle filtering on the decoding section of the s...

متن کامل

Optimized Fast Walsh-Hadamard Transform on GPUs for non-binary LDPC decoding

The Fourier Transform Sum-Product Algorithm (FT-SPA) used in non-binary Low-Density Parity-Check (LDPC) decoding makes extensive use of the Walsh-Hadamard Transform (WHT). We have developed a massively parallel Fast Walsh-Hadamard Transform (FWHT) which exploits the Graphics Processing Unit (GPU) pipeline and memory hierarchy, thereby minimizing the level of memory bank conflicts and maximizing...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009